全文获取类型
收费全文 | 2662篇 |
免费 | 170篇 |
国内免费 | 187篇 |
专业分类
化学 | 216篇 |
晶体学 | 4篇 |
力学 | 136篇 |
综合类 | 37篇 |
数学 | 2192篇 |
物理学 | 434篇 |
出版年
2024年 | 2篇 |
2023年 | 21篇 |
2022年 | 23篇 |
2021年 | 34篇 |
2020年 | 36篇 |
2019年 | 57篇 |
2018年 | 44篇 |
2017年 | 55篇 |
2016年 | 67篇 |
2015年 | 51篇 |
2014年 | 111篇 |
2013年 | 226篇 |
2012年 | 106篇 |
2011年 | 102篇 |
2010年 | 104篇 |
2009年 | 132篇 |
2008年 | 137篇 |
2007年 | 163篇 |
2006年 | 138篇 |
2005年 | 133篇 |
2004年 | 125篇 |
2003年 | 123篇 |
2002年 | 145篇 |
2001年 | 84篇 |
2000年 | 107篇 |
1999年 | 89篇 |
1998年 | 88篇 |
1997年 | 66篇 |
1996年 | 47篇 |
1995年 | 51篇 |
1994年 | 43篇 |
1993年 | 45篇 |
1992年 | 41篇 |
1991年 | 30篇 |
1990年 | 38篇 |
1989年 | 23篇 |
1988年 | 13篇 |
1987年 | 10篇 |
1986年 | 22篇 |
1985年 | 11篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 13篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有3019条查询结果,搜索用时 17 毫秒
71.
Y. Zhang 《Journal of Optimization Theory and Applications》1993,77(2):323-341
This paper concerns solving an overdetermined linear systemA
T
x=b in the leastl
1-norm orl
-norm sense, whereA
m×n
,m<n. We show that the primal-dual interior point approach for linear programming can be applied, in an effective manner, to linear programming versions of thel
1 andl
-problems. The resulting algorithms are simple to implement and can attain quadratic or superlinear convergence rate. At each iteration, the algorithms must solve a linear system with anm×m positive-definite coefficient matrix of the formADA
T
, whereD is a positive diagonal matrix. The preliminary numerical results indicate that the proposed algorithms offer considerable promise.This research was supported in part by Grants NSF DMS-91-02761 and DOE DE-FG05-91-ER25100. 相似文献
72.
In this paper, we develop an interior point algorithm for quadratically constrained entropy problems. The algorithm uses a variation of Newton's method to follow a central path trajectory in the interior of the feasible set. The primal-dual gap is made less than a given in at most
steps, wheren is the dimension of the problem andm is the number of quadratic inequality constraints. 相似文献
73.
Recently, Ye, Tapia and Zhang (1991) demonstrated that Mizuno—Todd—Ye's predictor—corrector interior-point algorithm for linear programming maintains the O(
L)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap to zero under the assumption of nondegeneracy. In this paper we establish the quadratic convergence result without any assumption concerning the convergence of the iteration sequence or nondegeneracy. This surprising result, to our knowledge, is the first instance of a demonstration of polynomiality and superlinear (or quadratic) convergence for an interior-point algorithm which does not assume the convergence of the iteration sequence or nondegeneracy.Supported in part by NSF Grant DDM-8922636 and NSF Coop. Agr. No. CCR-8809615, the Iowa Business School Summer Grant, and the Interdisciplinary Research Grant of the University of Iowa Center for Advanced Studies.Supported in part by NSF Coop. Agr. No. CCR-8809615, AFOSR 89-0363, DOE DEFG05-86ER25017 and ARO 9DAAL03-90-G-0093.Supported in part by NSF Grant DMS-9102761 and DOE Grant DE-FG05-91ER25100. 相似文献
74.
Using the Chern classes defined by Grothendieck, we map aK-theoretic invariant of invertible symmetric matrices defined by Giffen to the Clifford invariant.According to Herrmann Graßman'sWörterbuch zum Rig-veda, Ketu may not be connected with K2 but es bezeichnet das, was sich sichtbar oder kenntlich macht ... 相似文献
75.
Emanuele Galligani 《Numerical Algorithms》1993,5(11):549-555
Givenn pairwise distinct and arbitrarily spaced pointsP
i in a domainD of thex–y plane andn real numbersf
i, consider the problem of computing a bivariate functionf(x, y) of classC
1 inD whose values inP
i are exactlyf
i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ
l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy. 相似文献
76.
Paramagnetic metal ions bound to proteins generate a dipolar field that can be accurately probed by pseudocontact shifts (PCS) displayed by the protein's nuclear spins. PCS are highly useful for determining the coordinates of individual spins in the molecule and for rapid structure determinations of entire protein-protein and protein-ligand complexes. However, PCS measurements require reliable resonance assignments for the molecule in its paramagnetic state and in a diamagnetic reference state. This article discusses different approaches for pairwise resonance assignments, with emphasis on a strategy which exploits chemical exchange between the two states. 相似文献
77.
R. J. Williams 《Journal of Optimization Theory and Applications》1980,30(4):569-582
Mixed strategy -equilibrium points are given forN-person games with cost functions consisting of quadratic, bilinear, and linear terms and strategy spaces consisting of closed balls in Hilbert spaces. The results are applied to linear-quadratic differential games with no information and quadratic integral constraints on the control functions.This work was supported by a Commonwealth of Australia, Postgraduate Research Award. 相似文献
78.
The purpose of this paper is to present a new primal extreme point algorithm for solving assignment problems which both circumvents and exploits degeneracy. The algorithm is based on the observation that the degeneracy difficulties of the simplex method result from the unnecessary inspection of alternative basis representations of the extreme points. This paper characterizes a subsetQ of all bases that are capable of leading to an optimal solution to the problem if one exists. Using this characterization, an extreme point algorithm is developed which considers only those bases inQ. Computational results disclose that the new algorithm is substantially more efficient than previously developed primal and primal-dual extreme point (simplex) methods for assignment problems. 相似文献
79.
The main purpose of this paper is to present accurate infrared integrated intensities of liquid toluene, C6H5CH3, at 25 °C. Also presented are the decadic molar absorption coefficients, Em, the real and imaginary dielectric constants, ε′ and ε″, and the real and imaginary molar polarizabilities, ′m and ″m. Integrated intensities were determined as Cj, the area under bands in the spectrum, for all bands between 4800 and 440 cm−1. The contributions from the different bands were separated by fitting the spectrum with classical damped harmonic oscillator bands. The uncertainties in the integrated intensities of most bands are estimated to be 5–10%, with the uncertainties in very weak bands and in shoulders possibly up to 100%. The intensity that should be assigned to the fundamentals is more difficult to estimate due to Fermi resonance with overtone and combination bands, and a best estimate is given. The integrated intensities of the fundamental vibrations and the corresponding transition dipole moments are summarized and are compared with literature values for the gas. 相似文献
80.
Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rn1 and Y R
n2 are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010. 相似文献